Compositional coordinator synthesis of extended finite automata

To avoid the state-space explosion problem, a set of supervisors may be synthesized using divide and conquer strategies, like modular or multilevel synthesis. Unfortunately, these conflicting, meaning that even though they are individually non-blocking, together blocking. Abstraction-based compositional nonblocking verification extended finite automata provides means to verify whether models is nonblocking. In case blocking system, coordinator can resolve This paper presents framework for synthesis discrete-event systems modeled as automata. The allows on abstracted system in identifies As use notions not present original model, renamed events, refined such it will nonblocking, controllable, maximally permissive system. For each abstraction, shown how this refinement performed. It turns out presented abstractions straightforward.